On monochromatic paths and bicolored subdigraphs in arc-colored tournaments
نویسندگان
چکیده
Consider an arc-colored digraph. A set of vertices N is a kernel by monochromatic paths if all pairs of distinct vertices of N have no monochromatic directed path between them and if for every vertex v not in N there exists n ∈ N such that there is a monochromatic directed path from v to n. In this paper we prove different sufficient conditions which imply that an arc-colored tournament has a kernel by monochromatic paths. Our conditions concerns to some subdigraphs of T and its quasimonochromatic and bicolor coloration. We also prove that our conditions are not mutually implied and that they are not implied by those known previously. Besides some open problems are proposed.
منابع مشابه
Kernels and cycles' subdivisions in arc-colored tournaments
Let D be a digraph. D is said to be an m-colored digraph if the arcs of D are colored with m colors. A path P in D is called monochromatic if all of its arcs are colored alike. Let D be an m-colored digraph. A set N ⊆ V (D) is said to be a kernel by monochromatic paths of D if it satisfies the following conditions: a) for every pair of different vertices u, v ∈ N there is no monochromatic direc...
متن کاملAbsorbent sets and kernels by monochromatic directed paths in m-colored tournaments
In this paper, we consider the following problem due to Erdős: for each m ∈ N, is there a (least) positive integer f(m) so that every finite mcolored tournament contains an absorbent set S by monochromatic directed paths of f(m) vertices? In particular, is f(3) = 3? We prove several bounds for absorbent sets of m-colored tournaments under certain conditions on the number of colors of the arcs i...
متن کاملKernels by monochromatic paths in digraphs with covering number 2
We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A subdigraph H of D is called monochromatic if all of its arcs are colored alike. A set N ⊆ V (D) is said to be a kernel by monochromatic paths if it satisfies the following two conditions: (i) for every pair of different vertices u, v ∈ N there is no monochromatic directed path between them and; (ii) for eve...
متن کاملMonochromatic cycles and monochromatic paths in arc-colored digraphs
We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A path (or a cycle) is called monochromatic if all of its arcs are colored alike. A cycle is called a quasi-monochromatic cycle if with at most one exception all of its arcs are colored alike. A subdigraph H in D is called rainbow if all its arcs have different colors. A set N ⊆ V (D) is said to be a kernel b...
متن کاملPaths, Trees and Cycles in Tournaments
We survey results on paths, trees and cycles in tournaments. The main subjects are hamiltonian paths and cycles, vertex and arc disjoint paths with prescribed endvertices, arc-pancyclicity, oriented paths, trees and cycles in tournaments. Several unsolved problems are included.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 31 شماره
صفحات -
تاریخ انتشار 2011